Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complete graph")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1676

  • Page / 68
Export

Selection :

  • and

The Ramsey numbers for a cycle of length six or seven versus a clique of order sevenEDWIN CHENG, T. C; YAOJUN CHEN; YUNQING ZHANG et al.Discrete mathematics. 2007, Vol 307, Num 9-10, pp 1047-1053, issn 0012-365X, 7 p.Article

Ramsey numbers for a disjoint union of some graphsBIELAK, Halina.Applied mathematics letters. 2009, Vol 22, Num 4, pp 475-477, issn 0893-9659, 3 p.Article

Triangulations on closed surfaces which quadrangulate other surfaces IISUZUKI, Yusuke.Discrete mathematics. 2005, Vol 303, Num 1-3, pp 234-242, issn 0012-365X, 9 p.Conference Paper

Exponentially many nonisomorphic orientable triangular embeddings of K12sKORZHIK, Vladimir P.Discrete mathematics. 2008, Vol 308, Num 7, pp 1046-1071, issn 0012-365X, 26 p.Article

Four orthogonal one-factorizations on ten pointsDINITZ, J. H; WALLIS, W. D.North-Holland mathematics studies. 1985, Vol 114, Num 26, pp 143-149, issn 0304-0208Article

A new proof of a theorem of Graham and PollakPECK, G. M.Discrete mathematics. 1984, Vol 49, Num 3, pp 327-328, issn 0012-365XArticle

Certain 3-decompositions of complete graphs, with an application to finite fieldsROWLINSON, P.Proceedings of the Royal Society of Edinburgh. Section A. Mathematics. 1985, Vol 99, Num 3-4, pp 277-281, issn 0308-2105Article

Tolerance graphsGOLUMBIC, M. C; MONMA, C. L; TROTTER, W. T. JR et al.Discrete applied mathematics. 1984, Vol 9, Num 2, pp 157-170, issn 0166-218XArticle

The Ramsey number R(C8, K8)YUNQING ZHANG; KE MIN ZHANG.Discrete mathematics. 2009, Vol 309, Num 5, pp 1084-1090, issn 0012-365X, 7 p.Conference Paper

Threshold and complexity results for the cover pebbling gameGODBOLE, Anant P; WATSON, Nathaniel G; YERGER, Carl R et al.Discrete mathematics. 2009, Vol 309, Num 11, pp 3609-3624, issn 0012-365X, 16 p.Article

Scheduling sports tournaments on a single court minimizing waiting timesKNUST, Sigrid.Operations research letters. 2008, Vol 36, Num 4, pp 471-476, issn 0167-6377, 6 p.Article

Construction of sports schedules with multiple venuesDE WERRA, D; EKIM, T; RAESS, C et al.Discrete applied mathematics. 2006, Vol 154, Num 1, pp 47-58, issn 0166-218X, 12 p.Article

Profile minimization on products of graphsTSAO, Yu-Ping; CHANG, Gerard J.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 792-800, issn 0012-365X, 9 p.Article

Ramsey numbers for a disjoint union of good graphsBIELAK, Halina.Discrete mathematics. 2010, Vol 310, Num 9, pp 1501-1505, issn 0012-365X, 5 p.Conference Paper

Multicolored parallelisms of Hamiltonian cyclesFU, Hung-Lin; LO, Yuan-Hsun.Discrete mathematics. 2009, Vol 309, Num 14, pp 4871-4876, issn 0012-365X, 6 p.Article

Nonorientable triangular embeddings of complete graphs with arbitrarily large loosenessKORZHIK, Vladimir P; JIN HO KWAK.Discrete mathematics. 2008, Vol 308, Num 15, pp 3208-3212, issn 0012-365X, 5 p.Article

Solution of the conjecture : If n ≡ 0(mod 4), n > 4, then Kn has a super vertex-magic total labelingGOMEZ, J.Discrete mathematics. 2007, Vol 307, Num 21, pp 2525-2534, issn 0012-365X, 10 p.Article

Exponentially many nonisomorphic orientable triangular embeddings of K12s+3KORZHIK, Vladimir P.Discrete mathematics. 2009, Vol 309, Num 4, pp 852-866, issn 0012-365X, 15 p.Article

On the crossing numbers of Km□Cn and Km,l□PnZHENG WENPING; LIN XIAOHUI; YANG YUANSHENG et al.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1892-1907, issn 0166-218X, 16 p.Article

Optimal broadcasting with universal lists based on competitive analysisKIM, Jae-Hoon; CHWA, Kyung-Yong.Networks (New York, NY). 2005, Vol 45, Num 4, pp 224-231, issn 0028-3045, 8 p.Article

Isomorphic decomposition of complete graphs into linear forestsRUIZ, S.Journal of graph theory. 1985, Vol 9, Num 1, pp 189-191, issn 0364-9024Article

Hamiltonian decompositions of complete graphsHILTON, A. J. W.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 2, pp 125-134, issn 0095-8956Article

Graphes biplanaires et circuits imprimés = Biplanar graphs and printed circuitsMAYER, J.Comptes rendus des séances de l'Académie des sciences. Série 1, Mathématique. 1983, Vol 297, Num 6, pp 311-312, issn 0249-6291Article

Contractible edges in non-separating cyclesEGAWA, Y; SAITO, A.Combinatorica (Print). 1991, Vol 11, Num 4, pp 389-392, issn 0209-9683Article

Decomposition of the complete hypergraph into delta-systems IIMOUYART, A. F; STERBOUL, F.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 139-149, issn 0097-3165Article

  • Page / 68